Parametricity, type equality, and higher-order polymorphism
نویسندگان
چکیده
منابع مشابه
Parametricity, type equality, and higher-order polymorphism
Propositions that express type equality are a frequent ingredient of modern functional programming—they can encode generic functions, dynamic types, and GADTs. Via the Curry-Howard correspondence, these propositions are ordinary types inhabited by proof terms, computed using runtime type representations. In this paper we show that two examples of type equality propositions actually do reflect t...
متن کاملRelational Parametricity for Higher Kinds
Reynolds’ notion of relational parametricity has been extremely influential and well studied for polymorphic programming languages and type theories based on System F. The extension of relational parametricity to higher kinded polymorphism, which allows quantification over type operators as well as types, has not received as much attention. We present a model of relational parametricity for Sys...
متن کاملAnti-symmetry of higher-order subtyping and equality by subtyping
This paper gives the first proof that the subtyping relation of a higherorder lambda calculus, F ≤, is anti-symmetric, establishing in the process that the subtyping relation is a partial order—reflexive, transitive, and anti-symmetric up to β-equality. While a subtyping relation is reflexive and transitive by definition, anti-symmetry is a derived property. The result, which may seem obvious t...
متن کاملHigher-Order Unification, Polymorphism, and Subsorts
This paper analyzes the problems that arise in extending Huet’s higher-order unification algorithm from the simply typed λ-calculus to one with type variables. A simple, incomplete, but in practice very useful extension to Huet’s algorithm is discussed. This extension takes an abstract view of types. As a particular instance we explore a type system with ml-style polymorphism enriched with a no...
متن کاملEquality and extensionality in automated higher order theorem proving
This thesis focuses on equality and extensionality in automated higher-order theorem proving based on Church's simply typed -calculus (classical type theory). First, a landscape of various semantical notions is presented that is motivated by the di erent roles equality adopts in them. Each of the semantical notions in this landscape | including Henkin semantics | is then linked with an abstract...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Functional Programming
سال: 2010
ISSN: 0956-7968,1469-7653
DOI: 10.1017/s0956796810000079